FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
نویسندگان
چکیده
منابع مشابه
Finding the Weighted Minimax Flow in a Polynomial Time
We give a procedure of solving the weighted minimax flow problem in a polynomial time. The procedure utilizes the capacity modification technique and the binary search method. 1 . I NTRODUCTI ON We have considered variants of the maximum flow problems [5,6]. [5] discusses a minimax flo1N, i.e., the flow which minimizes the maximum arc-flow value among all flows of maximum flow value. [6] treats...
متن کاملFinding Relations in Polynomial Time
Given a set of m observations on n variables, an 0(mn) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative. Extension to the cases where squares, ratios,...
متن کاملA Polynomial Algorithm for Weighted Abstract Flow
Ford and Fulkerson’s original 1956 max flow/min cut paper formulated max flow in terms of flows on paths, rather than the more familiar flows on arcs. In 1974 Hoffman pointed out that Ford and Fulkerson’s original proof was quite abstract, and applied to a wide range of flow problems. In this abstract model we have capacitated elements, and linearly ordered subsets of elements called paths. Whe...
متن کاملConstant Factor Approximation Algorithm for Weighted Flow Time on a Single Machine in Pseudo-polynomial time
In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement pj , release date rj and weight wj . The goal is to find a preemptive schedule which minimizes the sum of weighted flow-time of jobs, where the flow-time of a job is the difference between its completion time and its released date. We give the first pseudo-polynomial ...
متن کاملA polynomial time algorithm for finding an approximate shortest path amid weighted regions
We devise a polynomial-time approximation scheme for the classical geometric problem of finding an ǫ-short path amid weighted regions. In this problem, a triangulated region P comprising of n triangles, a positive weight associated with each triangle, and two points s and t that belong to P are given as the input. The objective is to find a path whose cost is at most (1+ ǫ)OPT where OPT is the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1980
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.23.268